Grokking LinkedIn Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
LinkedIn Easy
Find Pivot Index (easy)
Solution: Find Pivot Index
Isomorphic Strings (easy)
Solution: Isomorphic Strings
Second Minimum Node In a Binary Tree (easy)
Solution: Second Minimum Node In a Binary Tree
Minimum Time to Type Word Using Special Typewriter (easy)
Solution: Minimum Time to Type Word Using Special Typewriter
Intersection of Two Arrays (easy)
Solution: Intersection of Two Arrays
Can Place Flowers (easy)
Solution: Can Place Flowers
Valid Perfect Square (easy)
Solution: Valid Perfect Square
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Sqrt (easy)
Solution: Sqrt
Valid Palindrome (easy)
Solution: Valid Palindrome
LinkedIn Medium
Rotate List (medium)
Solution: Rotate List
Find Leaves of Binary Tree (medium)
Solution: Find Leaves of Binary Tree
Valid Triangle Number (medium)
Solution: Valid Triangle Number
Valid Parenthesis String (medium)
Solution: Valid Parenthesis String
Edit Distance (medium)
Solution: Edit Distance
Remove All Ones With Row and Column Flips II (medium)
Solution: Remove All Ones With Row and Column Flips II
Reverse Integer (medium)
Solution: Reverse Integer
Triplet Sum to Zero (medium)
Solution: Triplet Sum to Zero
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Decode Ways (medium)
Solution: Decode Ways
Quadruple Sum to Target (medium)
Solution: Quadruple Sum to Target
Next Permutation (medium)
Solution: Next Permutation
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Word Search (medium)
Solution: Word Search
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
House Robber II (medium)
Solution: House Robber II
Coin Change
Solution: Coin Change
Design Add and Search Words Data Structure (medium)
Solution: Design Add and Search Words Data Structure
Merge Intervals (medium)
Solution: Merge Intervals
Number of Islands (easy)
Solution: Number of Islands
Longest Palindromic Subsequence (medium)
Solution: Longest Palindromic Subsequence
Kth Smallest Number (medium)
Solution: Kth Smallest Number
Maximum Product Subarray (medium)
Solution: Maximum Product Subarray
Same Tree (medium)
Solution: Same Tree
Max Points on a Line (hard)
Solution: Max Points on a Line
Closest Binary Search Tree Value II (hard)
Solution: Closest Binary Search Tree Value II
Word Ladder (hard)
Solution: Word Ladder
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Serialize and Deserialize Binary Tree (hard)
Solution: Serialize and Deserialize Binary Tree
Solution: Valid Parenthesis String

Problem Statement

Given a string s containing multiple occurrences of characters: '(', ')' and '*', return true if s is valid. Otherwise, return false.

A string is valid if it follows below rules:

  • Any left parenthesis '(' must be closed by corresponding right parenthesis ')'.
  • Any right parenthesis ')' must have a corresponding left parenthesis '('.
  • '*' can be used as a single left parenthesis ')' or a single right parenthesis '(' or an empty string "".

Examples

  • Example 1:

    • Input: s= "*())"
    • Expected Output: true
    • Justification: The asterisk can be treated as an open parenthesis, making the string "(())."
  • Example 2:

    • **Input: s = "((*()**"
    • Expected Output: true
    • **Justification: The first and second asterisks can be treated as close parenthesis, and the third asterisk can be treated as an empty string, resulting in a balanced set of parentheses "(()())."
  • Example 3:

    • Input: s = "())*"
    • Expected Output: false
    • Justification: There's no way to interpret the asterisk that would balance the extra close parenthesis at the start.

Solution

This solution employs a smart strategy to determine if a string with parentheses and asterisks is valid. It navigates through each character, adjusting counts to represent possible states of open parentheses. The core idea revolves around maintaining two counters: a low counter (lo) to represent the minimum possible open parentheses, assuming asterisks are used optimally, and a high counter (hi) to represent the maximum possible open parentheses, assuming all asterisks are treated as open parentheses.

This dual-counter approach captures the flexibility of asterisks, which can act as either open or close parentheses or be omitted. By updating these counters based on current character analysis and ensuring our high counter never drops below zero (which would indicate too many closing parentheses), we maintain a balance check. If, by the end of the string, our low counter resets to zero, it signifies that there's at least one valid way to interpret the string as properly balanced, making this method both efficient and effective in handling the problem's inherent ambiguity.

Step-by-step Algorithm

  1. Initialize two variables, lo and hi, to zero. These will track the lower and upper bounds of the count of open parentheses.
  2. Iterate through each character of the string s:
    • If the character is an open parenthesis '(', increment both lo and hi by 1. This is because an open parenthesis definitely increases the number of unclosed parentheses.
    • If the character is a close parenthesis ')', decrement both lo and hi by 1. This reflects closing an open parenthesis. However, since lo represents a minimum, it cannot be negative; thus, if lo drops below 0, reset it to 0.
    • If the character is an asterisk '*', increment hi by 1 (as it could act as an open parenthesis) but decrement lo by 1 (as it could act as a closing parenthesis). However, lo is adjusted to a minimum of 0 to avoid negative values.
    • After processing each character, check if hi is less than 0. If true, break the loop as it indicates there are too many closing parentheses, making the string invalid.
  3. After iterating through the string, check if lo equals 0. A lo of 0 indicates that there is a valid configuration where all open parentheses can be closed, thus the string is valid.

Algorithm Walkthrough

Given the input "((*()**", let's apply the algorithm:

  1. lo = 0, hi = 0 at the start.
  2. First character '(': increment both lo and hi by 1.
    • lo = 1, hi = 1.
  3. Second character '(': increment both lo and hi by 1 again.
    • lo = 2, hi = 2.
  4. Third character '*': lo could represent a closing parenthesis, so decrement by 1 (but not less than 0), and hi could represent an open parenthesis, so increment by 1.
    • lo = 1 (minimum of 1 and not less), hi = 3.
  5. Fourth character '(': increment both lo and hi by 1.
    • lo = 2, hi = 4.
  6. Fifth character ')': decrement both lo and hi by 1.
    • lo = 1, hi = 3.
  7. Sixth character '*': treat '*' similarly to the third character; decrement lo by 1 (to a minimum of 0) and increment hi.
    • lo = 0, hi = 4.
  8. Seventh character '*': continue with the same approach for '*'.
    • lo = 0, hi = 5.

After completing the iteration, lo is 0, which indicates the string "((*()**" can be valid, assuming asterisks are optimally used either as open parentheses, close parentheses, or not used at all.

Code

Java
Saved to Cloud

. . . .

Complexity Analysis

  • Time Complexity: , where n is the length of the input string. The algorithm iterates through the string once.
  • Space Complexity: , as the algorithm uses only a constant amount of extra space.
Valid Parenthesis String (medium)
Edit Distance (medium)
Mark as Completed

On this page

Problem Statement

Examples

Solution

Step-by-step Algorithm

Algorithm Walkthrough

Code

Complexity Analysis